Affine inequivalence of cubic Maiorana–McFarland type bent functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the affine classification of cubic bent functions

We consider cubic boolean bent functions, each cubic monomial of which contains the same variable. We investigate canonical forms of these functions under affine transformations of variables. In particular, we refine the affine classification of cubic bent functions of 8 variables. 1 Preliminaries Let Vn be an n-dimensional vector space over the field F2, and Fn be the set of all boolean functi...

متن کامل

Construction of cubic homogeneous boolean bent functions

We prove that cubic homogeneous bent functions f : V2n → GF(2) exist for all n ≥ 3 except for n = 4.

متن کامل

Mubs Inequivalence and Affine Planes

There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C for various prime powers N . The number of such sets is not bounded above by any polynomial as a function of N . While it is standard that there is a superficial similarity between complete sets of MUBs and finite affine planes, there is an intimate relationship between these large...

متن کامل

Affine equivalence of cubic homogeneous rotation symmetric functions

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 200...

متن کامل

Affine equivalence of cubic homogeneous rotation symmetric Boolean functions

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 200...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2013

ISSN: 0166-218X

DOI: 10.1016/j.dam.2012.11.017